Faster Sparse Interpolation of Straight-Line Programs
نویسندگان
چکیده
We give a new probabilistic algorithm for interpolating a “sparse” polynomial f given by a straight-line program. Our algorithm constructs an approximation f of f , such that f − f probably has at most half the number of terms of f , then recurses on the difference f−f. Our approach builds on previous work by Garg and Schost (2009), and Giesbrecht and Roche (2011), and is asymptotically more efficient in terms of the total cost of the probes required than previous methods, in many cases.
منابع مشابه
Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs
Given a straight-line program whose output is a polynomial function of the inputs, we present a new algorithm to compute a concise representation of that unknown function. Our algorithm can handle any case where the unknown function is a multivariate polynomial, with coefficients in an arbitrary finite field, and with a reasonable number of nonzero terms but possibly very large degree. It is co...
متن کاملFaster sparse polynomial interpolation of straight-line programs over finite fields
We present a faster Monte Carlo algorithm for the interpolation of a straightline program to find a sparse polynomial f over an arbitrary finite field of size q. We assume a priori bounds D and T are given on the degree and number of terms of f . The approach presented in this paper is a hybrid of the diversified and recursive interpolation algorithms, the two previous fastest known probabilist...
متن کاملAsymptotically Optimal Monte Carlo Sparse Multivariate Polynomial Interpolation Algorithms of Straight-Line Program
In this paper, we propose new deterministic interpolation algorithms and Monte Carlo interpolation algorithms for sparse multivariate polynomials represented by straight-line programs. Let f be an n-variate polynomial with a degree bound D and and term bound T . Our deterministic algorithms have better complexities than existing deterministic interpolation algorithms in most cases. Our Monte Ca...
متن کاملInterpolation of polynomials given by straight-line programs
We give an algorithm for the interpolation of a polynomial A given by a straight-line program. Its complexity is polynomial in τ, log(d), L, n, where τ is an input bound on the number of terms in A, d is a bound on its partial degree in all variables, L is the length of the given straight-line program and n is the number of variables.
متن کاملFaster fully compressed pattern matching algorithm for a subclass of straight-line programs
We show an efficient pattern-matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operation is the concatenation. In this paper, both text T and pattern P are given by straight-line programs T and P. The length of the text T (pattern P , resp.) may grow exponentially with respect to its description size ...
متن کامل